PN Code Algorithm for Improving Interference Cancellation of Multiple Access
نویسندگان
چکیده
منابع مشابه
Distributed Interference Cancellation in Multiple Access Channels
In this paper, we consider a Gaussian multiple access channel with multiple independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. The capacity region is characterized to within a constant gap regardless of channel parameters. These results are based on a layered modulo-lattice scheme which realizes distributed interference cancell...
متن کاملA selective and adaptive interference cancellation scheme for code division multiple access systems
In this paper, a new selective and adaptive parallel interference cancellation technique is presented for code division multiple access systems. The proposed technique performs a parallel interference cancellation in multistage, and the computational complexity is reduced by applying the cancellation to unreliable signals only. The performance of the proposed scheme is investigated through comp...
متن کاملDynamic Space-Code Multiple Access (DSCMA) System: A Double Interference Cancellation Multiple Access Scheme in Wireless Communications System
متن کامل
Parallel multiple access interference cancellation in optical DS-CDMA systems
This paper investigates the Parallel Interference Cancellation technique in Direct Sequence Optical Code Division Multiple Access (DS-OCDMA) system. In the proposed system, the estimated interference is removed from the received signal. We have developped a new approach to obtain the analytical expression of error probability in chip synchronous case, for Optical Orthogonal Codes (OOC). We have...
متن کاملDistributed Interference Cancellation in Multiple Access Channel with Transmitter Cooperation
We consider a two-user Gaussian multiple access channel with two independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. Transmitters are allowed to cooperate through finite-capacity links. The capacity region is characterized to within 3 and 1.5 bits for the stronger user and the weaker user respectively, regardless of channel para...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Academia-Industrial cooperation Society
سال: 2010
ISSN: 1975-4701
DOI: 10.5762/kais.2010.11.8.3053